Frames Beyond Words
نویسندگان
چکیده
منابع مشابه
Names in frames: infants interpret words in sentence frames faster than words in isolation.
In child-directed speech (CDS), adults often use utterances with very few words; many include short, frequently used sentence frames, while others consist of a single word in isolation. Do such features of CDS provide perceptual advantages for the child? Based on descriptive analyses of parental speech, some researchers argue that isolated words should help infants in word recognition by facili...
متن کاملWorlds Before and Beyond Words
The advent of computer-generated environments for simulating experience of the real world invites a reappraisal of the role of classical and neo-classical theories of computation (e.g. views of computation based on linguistic and logical frameworks). To make more effective use of computers in connection with Virtual Reality requires a shift in emphasis towards computers as state representers ra...
متن کاملDefining Words with Words: Beyond the Distributional Hypothesis
The way humans define words is a powerful way of representing them. In this work, we propose to measure word similarity by comparing the overlap in their definition. This highlights linguistic phenomena that are complementary to the information extracted from standard context-based representation learning techniques. To acquire a large amount of word definitions in a cost-efficient manner, we d...
متن کاملA Dynamic Learning Model for Categorizing Words Using Frames
1. Introduction Grammatical categories (e.g., noun, verb, and etc) are the building blocks of grammar, as grammars organize abstract linguistic categories rather than individual lexical items. Learning the categories of words is, thus, fundamental to the acquisition of language. Even theories in which learners are endowed with considerable innate linguistic knowledge allow that children need in...
متن کاملOn the number of frames in binary words
A frame is a square uu, where u is an unbordered word. Let F (n) denote the maximum number of distinct frames in a binary word of length n. We count this number for small values of n and show that F (n) is at most bn/2c + 8 for all n and greater than 7n/30− for any positive and infinitely many n. We also show that Fibonacci words, which are known to contain plenty of distinct squares, have only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Computer Review
سال: 2016
ISSN: 0894-4393,1552-8286
DOI: 10.1177/0894439315596385